Universal Secure Multiplex Network Coding With Dependent and Non-Uniform Messages
نویسندگان
چکیده
منابع مشابه
Universal Strongly Secure Network Coding with Dependent and Non-Uniform Messages
We construct a secure network coding that is strongly secure in the sense of Harada and Yamamoto [19] and universal secure in the sense of Silva and Kschischang [28], [29], while allowing arbitrary small but nonzero mutual information to the eavesdropper. Our secure network coding allows statistically dependent and non-uniform multiple secret messages, while all previous constructions of weakly...
متن کاملSecure Multiplex Coding Over Interference Channel with Confidential Messages
In this paper, inner and outer bounds on the capacity region of two-user interference channels with two confidential messages have been proposed. By adding secure multiplex coding to the error correction method in [15] which achieves the best achievable capacity region for interference channel up to now, we have shown that the improved secure capacity region compared with [2] now is the whole H...
متن کاملA construction of universal secure network coding
We construct a universal secure network coding. Our construction just modifies the transmission scheme at the source node and works with every linear coding at an intermediate node. We relax the security criterion such that the mutual information between the message and the eavesdropped signal is sufficiently small instead of strictly zero. Our construction allows the set of eavesdropped links ...
متن کاملWeakly Secure Network Coding
In this work we consider the problem of secure data transmission on an acyclic multicast network. A new information theoretic model for security is proposed that defines the system as secure if an eavesdropper is unable to get any “meaningful” information about the source. The “wiretap” network model by Cai and Yeung in which no information of the source is made available to the eavesdropper is...
متن کاملOAEP Is Secure under Key-Dependent Messages
Key-dependent message security, short KDM security, was introduced by Black, Rogaway and Shrimpton to address the case where key cycles occur among encryptions, e.g., a key is encrypted with itself. We extend this definition to include the cases of adaptive corruptions and arbitrary active attacks, called adKDM security incorporating several novel design choices and substantially differing from...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2017
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2694012